closed pairs中文是什么意思

中文翻译手机版

Shamos and hoey algorithm , divide and conquer , closest pair of points , complexity
在1998年，周玉林等人对sh算法进行了改进。
Choose a size large enough that the peak of the psf of the stars will be within the aperture , but small enough to resolve close pairs of stars
设置足够大的值，从而可以使恒星的点扩展函数范围在此半径之内，单也要小到足以区分密近双星。
As early as in 1975 , shamos and hoey first gave an o n - lg n - time divide - and - conquer algorithm sh algorithm in short for the problem of finding the closest pair of points
Shamos和hoey在1975年提出了在o n lg n时间内寻找平面内最近点对的分治算法。
5 yulin zhou , pengrong xiong , hong zhu . an improved algorithm about the closest pair of points on plane set . computer research and development , 1998 , 35 : 957 - 960
这样，在归并时,最坏情况只需要计算3n 2对点对之间的距离，从而使整个算法计算距离的复杂度降为3n lg n 2 ,这个值为最初sh算法的一半。
An improved algorithm for finding the closest pair of points qi ge , hai - tao wang , and hong zhu department of computer science and engineering , fudan university , shanghai 200433 , p . r . china
最简单的方法就是蛮力法，也就是将所有的点对的距离给求出来，然后得到距离最小的点对，这样的时间开销是平方量级的。